int zheban(Sqlist L, ElemType x) {
	int left, right, mid, find = 0;
	left = 0;
	right = L.len - 1;
	while (left <= right && find = 0) {
		mid = (right + left) / 2;
		if (x < a[mid])
			right = mid - 1;
		else	if (x > a[mid])
			left = mid + 1;
		else
			find = 1;
	}
	if (find == 1)
		return mid;
}